A Generalization of Maillet's Determinant and a Bound for the First Factor of the Class Number1
نویسنده
چکیده
AND A BOUND FOR THE FIRST FACTOR OF THE CLASS NUMBER1 L. CARLITZ 1. Let p be a prime e¿3. For (r, p) = l define r' by means of rr' = l(mod£); also let R(r) denote the least positive residue of r (mod p). Maillet defined the determinant Dp of order (p—1)/2 by means of (1) A, R(rs') | (r, s = 1, • • • , (p l)/2) and raised the question whether Dp^0 for all p. Malo computed Dp for p^ 13 and conjectured that (2) d,= (-py*-s)'2.
منابع مشابه
A class of Artinian local rings of homogeneous type
Let $I$ be an ideal in a regular local ring $(R,n)$, we will find bounds on the first and the last Betti numbers of $(A,m)=(R/I,n/I)$. if $A$ is an Artinian ring of the embedding codimension $h$, $I$ has the initial degree $t$ and $mu(m^t)=1$, we call $A$ a {it $t-$extended stretched local ring}. This class of local rings is a natural generalization of the class of stretched ...
متن کاملAn upper bound to the second Hankel functional for the class of gamma-starlike functions
The objective of this paper is to obtain an upper bound to the second Hankel determinant $|a_{2}a_{4}-a_{3}^{2}|$ for the function $f$, belonging to the class of Gamma-starlike functions, using Toeplitz determinants. The result presented here include two known results as their special cases.
متن کاملGeneralization of Dodgson's "Virtual Center" Method; an Efficient Method for Determinant Calculation
Charles Dodgson (1866) introduced a method to calculate matrices determinant, in asimple way. The method was highly attractive, however, if the sub-matrix or the mainmatrix determination is divided by zero, it would not provide the correct answer. Thispaper explains the Dodgson method's structure and provides a solution for the problemof "dividing by zero" called "virtua...
متن کاملA generalized implicit enumeration algorithm for a class of integer nonlinear programming problems
Presented here is a generalization of the implicit enumeration algorithm that can be applied when the objec-tive function is being maximized and can be rewritten as the difference of two non-decreasing functions. Also developed is a computational algorithm, named linear speedup, to use whatever explicit linear constraints are present to speedup the search for a solution. The method is easy to u...
متن کاملA Bound for the Nilpotency Class of a Lie Algebra
In the present paper, we prove that if L is a nilpotent Lie algebra whose proper subalge- bras are all nilpotent of class at most n, then the class of L is at most bnd=(d 1)c, where b c denotes the integral part and d is the minimal number of generators of L.
متن کامل